Generate Good Triangular Meshes, Conforming to Control Spacing Requirements
نویسندگان
چکیده
To conduct numerical simulations by finite element methods, we often need to generate a high quality mesh, yet with a smaller number of elements. Moreover, the size of each of the elements in the mesh should be approximately equal to a given size requirement. Li et al. recently proposed a new method, named biting, which combines the strengths of advancing front and sphere packing. It generates high quality meshes with a theoretical guarantee. In this paper, we show that biting squares instead of circles not only generates high quality meshes but also has the following advantages. It is easier to generate high quality elements near the boundary with theoretical guarantee; it is very efficient time-wise; in addition, it is easier to implement. Furthermore, it provides simple and straightforward boundary protections in three dimensions. keyword: Unstructured mesh generation, advancing front, biting, sphere packing, spacing function.
منابع مشابه
A local refinement algorithm for the longest-edge trisection of triangle meshes
In this paper we present a local refinement algorithm based on the longest-edge trisection of triangles. Local trisection patterns are sed to generate a conforming triangulation, depending on the number of non-conforming nodes per edge presented. We describe he algorithm and provide a study of the efficiency (cost analysis) of the triangulation refinement problem. The algorithm presented, nd it...
متن کاملGeneration of quadrilateral mesh over analytical curved surfaces
An automatic adaptive quadrilateral mesh conversion scheme for the generation of adaptive refinement meshes over analytical curved surfaces is proposed. The starting point of the quadrilateral mesh generator is a background triangular mesh of the curved surface. By a carefully controlled process to merge two triangles at a time the triangular mesh can be completely converted to quadrilaterals. ...
متن کاملElliptic Grids with Nearly Uniform Cell Area and Line Spacing
Two new quasi-linear elliptic systems of partial differential equations to automatically generate twodimensional boundary conforming structured grids are formulated. One of the new systems generates grids with near-uniform cell areas. The other produces meshes with near-uniform coordinate line spacings. In both cases, the resulting grids conform to complex boundaries with severe singularities w...
متن کاملDelaunay Triangulation for Curved Surfaces
Surface triangular meshing plays an important role in the areas of computer graphics and engineering analysis. Traditionally, surface meshing is achieved by mapping meshes created in 2D parametric space onto surfaces. Care is taken in generating meshes in the parametric space and mapping them to surfaces because the transformation of geometry from the parameter space to the real space could be ...
متن کاملConforming and divergence-free Stokes elements on general triangular meshes
We present a family of conforming finite elements for the Stokes problem on general triangular meshes in two dimensions. The lowest order case consists of enriched piecewise linear polynomials for the velocity and piecewise constant polynomials for the pressure. We show that the elements satisfy the inf-sup condition and converges optimally for both the velocity and pressure. Moreover, the pres...
متن کامل